Eecient Implementation of Fft-like Algorithms on Mimd Systems
نویسنده
چکیده
منابع مشابه
Derivation of Eecient Data Parallel Programs
This paper considers the expression and derivation of eecient data parallel programs for SIMD and MIMD machines. It is shown that eecient parallel programs must utilise both sequential and parallel computation; these are termed hybrid programs. The Bird{Meertens formalism, a calculus of higher order functions, is used to derive and express programs. Our goal is to derive eecient parallel progra...
متن کاملA Class of Parallel Iterative Median-type Algorithms for Efficient Image Processing
| This paper proposes a class of parallel iterative median-type lters to restore signals degraded by Gaussian noise. An eecient implementation of these lters on distributed memory MIMD machines is outlined. Iterative median-type algorithms have been implemented with high eeciency (> 90%) on the Fujitsu AP1000. We conclude that algorithms of this type are very suitable for parallel implementatio...
متن کاملParallel Woll Cluster Algorithms
The Woll single-cluster algorithm is the most eecient method known for Monte Carlo simulation of many spin models. Due to the irregular size, shape and position of the Woll clusters, this method does not easily lend itself to eecient parallel implementation, so that simulations using this method have thus far been connned to workstations and vector machines. Here we present two parallel impleme...
متن کاملStable and Efficient Algorithms for Structured Systems of Linear Equations
Recent research shows that structured matrices such as Toeplitz and Hankel matrices can be transformed into a diierent class of structured matrices called Cauchy-like matrices using the FFT or other trigonometric transforms. Gohberg, Kailath and Olshevsky demonstrate numerically that their fast variation of the straightforward Gaussian elimination with partial pivoting (GEPP) procedure on Cauch...
متن کاملA Fast, Storage-eecient Parallel Sorting Algorithm
A parallel sorting algorithm is presented for storage-eecient internal sorting on MIMD machines. The algorithm rst sorts the elements within each node using a serial sorting algorithm, then uses a two-phase parallel merge. The algorithm is comparison-based and requires additional storage of order the square root of the number of elements in each node. Performance of the algorithm on two general...
متن کامل